Subdifferential Calculus Rules for Supremum Functions in Convex Analysis
نویسندگان
چکیده
Extending and improving some recent results of Hantoute, López, and Zălinescu and others, we provide characterization conditions for subdifferential formulas to hold for the supremum function of a family of convex functions on a real locally convex space.
منابع مشابه
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. Our formula is given exclusively in terms of the data functions, and does not require any assumption either on the index set on which the supremum is taken or on the involved functions. Some other calculus rules, namel...
متن کاملElements of Quasiconvex Subdifferential Calculus
A number of rules for the calculus of subdifferentials of generalized convex functions are displayed. The subdifferentials we use are among the most significant for this class of functions, in particular for quasiconvex functions: we treat the Greenberg-Pierskalla’s subdifferential and its relatives and the Plastria’s lower subdifferential. We also deal with a recently introduced subdifferentia...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملNew results in subdifferential calculus with applications to convex optimization
Chain and addition rules of subdifferential calculus are revisited in the paper and new proofs, providing local necessary and sufficient conditions for their validity, are presented. A new product rule pertaining to the composition of a convex functional and a Young function is also established and applied to obtain a proof of Kuhn-Tucker conditions in convex optimization under minimal assumpti...
متن کاملRelating lexicographic smoothness and directed subdifferentiability
Lexicographic derivatives developed by Nesterov and directed subdifferentials developed by Baier, Farkhi, and Roshchina are both essentially nonconvex generalized derivatives for nonsmooth nonconvex functions and satisfy strict calculus rules and mean-value theorems. This article aims to clarify the relationship between the two generalized derivatives. In particular, for scalar-valued functions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 21 شماره
صفحات -
تاریخ انتشار 2011